A Hybrid Ordering Scheme for Efficient Sparse Cholesky Factorization
نویسندگان
چکیده
منابع مشابه
Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization
Greedy algorithms for ordering sparse matrices for Cholesky factorization can be based on diierent metrics. Minimum degree, a popular and eeective greedy ordering scheme, minimizes the number of nonzero entries in the rank-1 update (degree) at each step of the factorization. Alternatively, minimum deeciency minimizes the number of nonzero entries introduced (deeciency) at each step of the facto...
متن کاملParallel Sparse Cholesky Factorization with Spectral Nested Dissection Ordering
We show that the use of the spectral nested dissection (SND) ordering leads to an efficient parallel sparse Cholesky factorization on an Intel Paragon multiprocessor. I Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162 and ICASE, NASA Langley Research Center, Hampton, VA 236810001 (pothsnlcs .odu. edu, pothsnOicaso, sdu). The research of the first and fourth author...
متن کاملModifying a Sparse Cholesky Factorization
Given a sparse symmetric positive definite matrix AAT and an associated sparse Cholesky factorization LDLT or LLT, we develop sparse techniques for obtaining the new factorization associated with either adding a column to A or deleting a column from A. Our techniques are based on an analysis and manipulation of the underlying graph structure and on ideas of Gill et al. [Math. Comp., 28 (1974), ...
متن کاملParallel Sparse Cholesky Factorization
Sparse matrix factorization plays an important role in many numerical algorithms. In this paper we describe a scalable parallel algorithm based on the Multifrontal Method. Computational experiments on a Parsytec CC system with 32 processors show that large sparse matrices can be factorized in only a few seconds.
متن کاملA latency tolerant hybrid sparse solver using incomplete Cholesky factorization
Consider the solution of large sparse symmetric positive de nite linear systems using the preconditioned conjugate gradient method. On sequential architectures, incomplete Cholesky factorizations provide effective preconditioning for systems from a variety of application domains, some of which may have widely di ering preconditioning requirements. However, incomplete factorization based precond...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energy Procedia
سال: 2011
ISSN: 1876-6102
DOI: 10.1016/j.egypro.2011.10.251